The Formalization of Decision-Free Petri Net

The Formalization of Decision-Free Petri Net

In this article we formalize the definition of Decision-Free Petri Net (DFPN) presented in [19]. Then we formalize the concept of directed path and directed circuit nets in Petri nets to prove properties of DFPN. We also present the definition of firing transitions and transition sequences with natural numbers marking that always check whether transition is enabled or not and after firing it on...

Data Decision Diagrams for Petri Net Analysis

This paper presents a new data structure, the Data Decision Diagrams, equipped with a mechanism allowing the definition of application-specific operators. This mechanism is based on combination of inductive linear functions offering a large expressiveness while alleviating for the user the burden of hard coding traversals in a shared data structure. We demonstrate the pertinence of our system t...

On the Petri net realization of context-free graphs

The Petri Net Baukastenn: an Application-oriented Petri Net Technology

The basic concepts of the Petri Net Baukastenn are introduced. The Petri Net Baukastenn is a Petri net technology and provides Petri net techniques. The Petri Net Baukastenn is consists of the Common Base and three diierent views, the Application Developer View, the Tool Developer View, and the Expert View. The main focus is to support the application developer and the tool developer as well as...

A Colored Petri Net Model of Distributed Tactical Decision Making*

A Colored Petri Net implementation of the mathematical model of a decision making organization that forms the basis of an experiment currently being carried out is presented. The model is used to investigate coordination mechanisms by decoupling the information flow paths and the coordination mechanisms into two interacting layers in which the coordination layer coordinates the behavior of the ...